Computational complexity - PDFSEARCH.IO - Document Search Engine

Computational complexity
Results: 2253

#	Item
851	VOTING SYSTEM RISK ASSESSMENT VIA COMPUTATIONAL COMPLEXITY ANALYSIS Dan S. Wallach* ABSTRACT Add to Reading List Source URL: accurate-voting.org Language: English - Date: 2013-06-05 15:32:08 Elections Election technology Information society Voting system Voter-verified paper audit trail Electoral fraud Voting machine Absentee ballot Vote counting system Politics Election fraud Electronic voting
852	Securing Mediated Trace Access Using Black-box Permutation Analysis 1. Prateek Mittal Add to Reading List Source URL: www.princeton.edu Language: English - Date: 2013-07-24 17:00:05 Computational complexity theory Science Data Encryption Standard Ethology Scientific modeling ICE Output
853	NEW JERSEY DEPARTMENT OF THE TREASURY DIVISION OF REVENUE AND ENTERPRISE SERVICES CERTIFICATE OF INC, (NON PROFIT) COMPUTATIONAL COMPLEXITY FOUNDATION INCThe above-named DOMESTIC NON-PROFIT CORPORATION was d Add to Reading List Source URL: computationalcomplexity.org Language: English - Date: 2014-07-24 04:30:49 Law Structure New Jersey Department of the Treasury Federal Reserve System Internal Revenue Code Business Nonprofit organization Corporation Foundation
854	Advanced Algorithms – COMS31900Lecture 19 Approximation Algorithms (part four) Asymptotic Polynomial Time Approximation Schemes Add to Reading List Source URL: www.cs.bris.ac.uk Language: English - Date: 2014-03-11 09:18:22 Complexity classes Approximation algorithms NP-complete problems Polynomial-time approximation scheme Time complexity NP PTAS L-reduction APX Theoretical computer science Computational complexity theory Applied mathematics
855	CS109A Notes for LectureProbability Space Set of points, each with an attached probability (nonnegative, real number), such that the sum of the probabilities is 1. Add to Reading List Source URL: infolab.stanford.edu Language: English - Date: 2008-09-19 00:58:06 Applied mathematics Probability space Randomized algorithm Probability Independence Expected value PP Discrete choice Theoretical computer science Probability theory Computational complexity theory
856	How to find the best approximation results – a follow-up to Garey and Johnson∗ Pierluigi Crescenzi† Viggo Kann‡ Add to Reading List Source URL: www.nada.kth.se Language: English - Date: 1998-12-21 18:16:27 Complexity classes Mathematical optimization NP-complete problems Combinatorial optimization Approximation algorithm NP-complete Hardness of approximation Optimization problem Reduction Theoretical computer science Computational complexity theory Applied mathematics
857	doi:j.ipl Add to Reading List Source URL: www.cc.ntut.edu.tw Language: English - Date: 2008-03-02 23:12:13 Automated theorem proving NP-complete problems Unit propagation 2-satisfiability Time complexity Variable MAX-3SAT (SAT ε-UNSAT) Theoretical computer science Mathematics Computational complexity theory
858	A Turing Machine Resisting Isolated Bursts Of Faults Add to Reading List Source URL: cjtcs.cs.uchicago.edu Language: English - Date: 2013-03-28 00:33:04 Computability theory Models of computation Computer science Alan Turing Formal methods Computational complexity theory Cellular automaton Non-deterministic Turing machine Busy beaver Turing machine Theory of computation Theoretical computer science
859	CrossMark_Color_Stacked_p Add to Reading List Source URL: www.alisongopnik.com Language: English - Date: 2014-04-06 02:28:03 Philosophy of science SO Philosophy Science Epistemology Computational complexity theory Causality Conditionals
860	Measuring Empirical Computational Complexity Simon F. Goldsmith∗ Alex S. Aiken Computer Science Dept. Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2007-07-04 18:03:01 Estimation theory Parallel computing Project management Scalability Transaction processing Cluster analysis Linear regression Computer cluster Regression analysis Statistics Computing Econometrics

UPDATE